dual simplex algorithm
英 [ˈdjuːəl ˈsɪmpleks ˈælɡərɪðəm]
美 [ˈduːəl ˈsɪmpleks ˈælɡərɪðəm]
对偶单纯形算法
双语例句
- By analyzing the essence of iteration on the dual simplex algorithm and based on Linear Programming with normal form, this paper gains another improved dual simplex algorithm without bringing in surplus variables, which results in the same number of variables and reduced operational size.
通过分析对偶单纯形法迭代的实质，就所给LP问题的规范形式，不引进剩余变量而直接得出另一种改进的对偶单纯形法，使变量个数不增且运算规模缩小。 - A Dual Simplex Algorithm for Solving Linear Goal programming with Bounded Variables
变量有界线性目标规划的对偶算法 - Improved Dual Simplex Algorithm on Linear Programming with Normal Form
规范形式LP问题的改进对偶单纯形法 - To solve a linear programming with the dual simplex algorithm, it is necessary to find a primal regular solution.
在用对偶单纯形法解线性规划问题时，必须找到初始正则解。 - Compared with the dual simplex method, the amount of the storage and calculations of the improved algorithm is largely reduced.
与原对偶单纯形法相比，改进算法的存贮量和计算量大大减少。 - It has more advantages than primal simplex algorithm, two-stage simplex algorithm and dual simplex algorithm.
它比原始单纯形法、两阶段单纯形法、对偶单纯形法具有更大的优越性。 - Primal-dual Simplex Algorithm
原始&对偶单纯形算法 - We also present the dual simplex algorithm for solving linear discrete programming and post optimality analysis based on the quasi-goal programming algorithm.
基于拟目标规划法给出了线性离散规划的对偶单纯形算法和灵敏度分析。